A Probabilistic Upper Bound on Differential Entropy
نویسندگان
چکیده
منابع مشابه
An Upper Bound on the Entropy Series
where 0 log 0 is taken as 0. Assume that the p~ are nonincreasing in n (reordering of the p~ does not affect H) . In a recent paper, Keilson (1971) showed that a sufficient condition for the series in (1) to be summable is that oo (i) Z1 P~ log n < ~ and (ii) P,.k ~ 1 / kp , as n ~ ~ for all fixed h = 1, 2 , . . . . I t will follow from the results given here that condition (i) alone is suffici...
متن کاملAn Upper Bound on Quantum Entropy
Following ref [1], a classical upper bound for quantum entropy is identified and illustrated, 0 ≤ Sq ≤ ln(eσ/ 2~), involving the variance σ in phase space of the classical limit distribution of a given system. A fortiori, this further bounds the corresponding information-theoretical generalizations of the quantum entropy proposed by Rényi.
متن کاملA New Tight Upper Bound on the Entropy of Sums
We consider the independent sum of a given random variable with a Gaussian variable and an infinitely divisible one. We find a novel tight upper bound on the entropy of the sum which still holds when the variable possibly has an infinite second moment. The proven bound has several implications on both information theoretic problems and infinitely divisible noise channels’ transmission rates.
متن کاملAn Upper Bound for Uniform Entropy Numbers
Let r > 1 and let Q be a probability measure on a measurable space (X, .4). In this note, we present a proof of a useful bound in Lr ( Q)-norm for the entropy of a convex hull in the case that covering numbers for a class of measurable functions are polynomial.
متن کاملProbabilistic Upper Bound Using Linear Cuts
As a direct extension of the structured singular value framework from the worst-case to the probabilistic robustness analysis, probabilistic deenes a probability measure of performance assuming some distribution on the uncertainty. Exact computation of probabilistic is intractable. Standard branch and bound methods with axially aligned cuts had been applied to compute a hard upper bound for pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2008
ISSN: 0018-9448
DOI: 10.1109/tit.2008.929937